Hierarchical minimization of two maximum costs on a bounded serial-batching machine

This paper studies a hierarchical optimization problem of scheduling n jobs on serial-batching machine, in which two objective functions are maximum costs. By problem, we mean the optimizing secondary criterion under constraint that primary is optimized. A machine can handle up to b batch and start complete respectively at same time processing equal sum times batch. When new starts, constant setup s occurs. We confine ourselves bounded model, where < . present an O ( 4 )-time algorithm for this problem. For special case lateness, give 3 log algorithm.